منابع مشابه
On a Min-max Theorem of Cacti
A simple proof is presented for the min-max theorem of Lovv asz on cacti. Instead of using the result of Lovv asz on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem.
متن کاملOn a min-max theorem on bipartite graphs
Frank, Sebő and Tardos [4] proved that for any connected bipartite graft (G, T ), the minimum size of a T-join is equal to the maximum value of a partition of A, where A is one of the two colour classes of G. Their proof consists of constructing a partition of A of value |F |, by using a minimum T-join F. That proof depends heavily on the properties of distances in graphs with conservative weig...
متن کاملA Min Flow Max Cut Theorem
Consider a network of pipes joining a set of intakes (the source) to a separate set of outlets (the e n sink), so that liquid flows from the intakes, through the network, to the outlets. A cross-section of th etwork, separating the intakes on one side from the outlets on the other, is called a cut. A minimal t c cut is one that, roughly speaking, slices through a set of pipes whose combined cap...
متن کاملThe Duality Theorem for Min-max Functions
The set of min-max functions F : R → R is the least set containing coordinate substitutions and translations and closed under pointwise max, min, and function composition. The Duality Conjecture asserts that the trajectories of a min-max function, considered as a dynamical system, have a linear growth rate (cycle time) and shows how this can be calculated through a representation of F as an inf...
متن کاملThe Duality Theorem for Min - Max Functionsst
The set of min-max functions F : R n ! R n is the least set containing coordinate substitutions and translations and closed under pointwise max, min, and function composition. The Duality Conjecture asserts that the trajectories of a min-max function, considered as a dynamical system, have a linear growth rate (cycle time) and shows how this can be calculated through a representation of F as an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/060649987